Combining Static Analysis and Model Checking for Systems Employing Commutative Functions

The two main hindrances for a wider application of the model checking approach for verification of concurrent and distributed systems are the state explosion problem and its limitation in handling infinite state systems. We consider a class of infinite state systems given by certain types of Transition Diagrams (TDs), called simple TDs, that employ commutative functions for updating variables. For such systems, we presented model checking methods that combine bi-simulation reductions with static analysis. The new methods are extensions of earlier methods where static analysis was not employed. These methods can be applied to a wider class of systems.